Randomness and Non-Locality
نویسندگان
چکیده
منابع مشابه
Balancing locality and randomness in DHTs
Embedding locations in DHT node IDs makes locality explicit and, thereby, enables engineering of the trade-off between careful placement and randomized load balancing. This paper discusses hierarchical, topology-exposed DHTs and their benefits for content locality, and administrative control and routing locality. We thank the members and companies of the PDL Consortium (including EMC, Hewlett-P...
متن کاملBalancing Locality and Randomness in DHTs (CMU-CS-03-203)
Embedding locations in DHT node IDs makes locality explicit and, thereby, enables engineering of the trade-off between careful placement and randomized load balancing. This paper discusses hierarchical, topology-exposed DHTs and their benefits for content locality, and administrative control and routing locality. We thank the members and companies of the PDL Consortium (including EMC, Hewlett-P...
متن کاملRandomness Extraction in AC0 and with Small Locality
We study two variants of seeded randomness extractors. The first one, as studied by Goldreich et al. [8], is seeded extractors that can be computed by AC circuits. The second one, as introduced by Bogdanov and Guo [3], is (strong) extractor families that consist of sparse transformations, i.e., functions that have a small number of overall input-output dependencies (called sparse extractor fami...
متن کاملRandomness and Non-determinism
Exponentiation makes the difference between the bit-size of this line and the number (≪ 2) of particles in the known Universe. The expulsion of exponential time algorithms from Computer Theory in the 60’s broke its umbilical cord from Mathematical Logic. It created a deep gap between deterministic computation and – formerly its unremarkable tools – randomness and non-determinism. Little did we ...
متن کاملNon-cupping and Randomness
Let Y ∈ ∆2 be Martin-Löf-random. Then there is a promptly simple set A such that for each Martin-Löf-random set Z, Y ≤T A ⊕ Z ⇒ Y ≤T Z. When Y = Ω, one obtains a c.e. non-computable set A which is not weakly Martin-Löf cuppable. That is, for any Martin-Löf-random set Z, if ∅′ ≤T A⊕ Z, then ∅′ ≤T Z.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fluctuation and Noise Letters
سال: 2016
ISSN: 0219-4775,1793-6780
DOI: 10.1142/s0219477516400058